Binary Words Avoiding xxx and Strongly Unimodal Sequences
نویسندگان
چکیده
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxxR was intermediate between polynomial and exponential. We now show that the same result holds for the growth of the number of binary words avoiding the pattern xxRx. Curiously, the analysis for xxRx is much simpler than that for xxxR. We derive our results by giving a bijection between the set of binary words avoiding xxRx and a class of sequences closely related to the class of “strongly unimodal sequences”.
منابع مشابه
Binary words avoiding xx^Rx and strongly unimodal sequences
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxx R was intermediate between polynomial and exponential. We now show that the same holds for the growth of the number of binary words avoiding the pattern xx R x. Curiously, the analysis for xx R x is much simpler than that for xxx R. We derive our results by giving a bijection bet...
متن کاملAvoiding large squares in infinite binary words
We consider three aspects of avoiding large squares in infinite binary words. First, we construct an infinite binary word avoiding both cubes xxx and squares yy with |y| ≥ 4; our construction is somewhat simpler than the original construction of Dekking. Second, we construct an infinite binary word avoiding all squares except 0, 1, and (01); our construction is somewhat simpler than the origina...
متن کاملGROWTH RATE OF BINARY WORDS AVOIDING xxx
Consider the set of those binary words with no non-empty factors of the form xxx. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the existence of upper and lower bounds on the number of such words of length n, where each of these bounds is asymptotically equivalent to a (different) function of th...
متن کاملGrowth rate of binary words avoiding xxxR
Consider the set of those binary words with no non-empty factors of the form xxx R. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the existence of upper and lower bounds on the number of such words of length n, where each of these bounds is asymptotically equivalent to a (different) function of ...
متن کاملInfinite Sequences and Pattern Avoidance
The study of combinatorics on words dates back at least to the beginning of the 20 century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains no squares (identical adjacent blocks) xx. This result was eventually used to solve some longstanding open problems in algebra and has remarkable connections to other areas of ma...
متن کامل